Search%2Dlog anonymization and advertisement are they mutually exclusive%3F

Practical and Secure Integer Comparison and Interval Check.

d%2DPresence without Complete World Knowledge.

Efficient privacy%2Dpreserving similar document detection.

t%2DPlausibility Semantic Preserving Text Sanitization.
Text documents play significant roles in decision making and scientific research. Under federal regulations, documents (e.g., pathology records) containing personally identifiable information cannot be shared freely, unless properly sanitized. Generally speaking, document sanitization consists of finding and hiding personally identifiable information. The first task has received much attention from the research community, but the main strategy for the second task has been to simply remove personal identifiers. It is not hard to see that if important information (e.g., diagnoses and personal medical histories) is completely removed from pathology records, these records are no longer readable, and even worse, they no longer contain sufficient information for research purposes. Observe that the sensitive information “tuberculosis ” can be replaced with the less sensitive term “infectious disease”. That is, instead of simply removing sensitive terms, these terms can be hidden by more general but semantically related terms to protect sensitive information, without unnecessarily degrading the amount of information contained in the document. Based on this observation, the main contribution of this paper is to provide a novel information theoretic approach to text sanitization, develop efficient heuristics to sanitize text documents, and analyze possible attacks preventable under the proposed model. 1.
Assured Information Sharing Life Cycle.



Individually Identifiable Data.
Abstract. k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. This paper presents a k-anonymity protocol when the data is vertically partitioned between sites. A key contribution is a proof that the protocol preserves k-anonymity between the sites: While one site may have individually identifiable data, it learns nothing that violates k-anonymity with respect to the data at the other site. This is a fundamentally different distributed privacy definition than that of Secure Multiparty Computation, and it provides a better match with both ethical and legal views of privacy.
Privacy Metrics.
A fruitful direction for future data mining research will be the development of techniques that incorporate privacy concerns. Specifically, we address the following question. Since the primary task in data mining is the development of models about aggregated data, can we develop accurate models without access to precise information in individual data records? We consider the concrete case of building a decision-tree classifier from tredning data in which the values of individual records have been perturbed. The resulting data records look very different from the original records and the distribution of data values is also very different from the original distribution. While it is not possible to accurately estimate original values in individual data records, we propose a-novel reconstruction procedure to accurately estimate the distribution of original data values. By using these reconstructed distributions, we are able to build classifiers whose accuracy is comparable to the accuracy of classifiers built with the original data. 
Privacy%2DPreserving Data Mining.
In this paper we address the issue of privacy preserving data mining. Specifically, we consider a  scenario in which two parties owning confidential databases wish to run a data mining algorithm on  the union of their databases, without revealing any unnecessary information. Our work is motivated  by the need to both protect privileged information and enable its use for research or other purposes. The
Privacy%2DPreserving Kth Element Score over Vertically Partitioned Data.

Multirelational k%2DAnonymity.
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any ident~fying information occurs in at least k tuples. Much research has been done to modify a single table dataset to satisfy anonymity constraints. This paper extends the dejinitions of k-anonymity to multiple relations and shows that previously proposed methodologies either fail to protect privacy, or overly reduce the utility of the data, in a multiple relation setting. We also propose mo new clustering algorithms to achieve multirelational anonymity. Experiments show the effectiveness of the approach in terms of utility and efficiency.
Opportunities for private and secure machine learning.

Collaborative Search and User Privacy How Can They Be Reconciled%3F.

Similar Document Detection with Limited Information Disclosure.

Transforming semi%2Dhonest protocols to ensure accountability.

An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems.
doi 10.1287/msom.1070.0167
Privacy%2Dpreserving decision trees over vertically partitioned data.
Abstract. Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. In this paper, we tackle the problem of classification. We introduce a generalized privacy preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with the algorithm, we give a complete proof of security that gives a tight bound on the information revealed. 1
Privacy%2Dpreserving decision trees over vertically partitioned data.
Abstract. Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. In this paper, we tackle the problem of classification. We introduce a generalized privacy preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with the algorithm, we give a complete proof of security that gives a tight bound on the information revealed. 1
Privacy%2Dpreserving Na%EFve Bayes classification.

Identifying Rare Classes with Sparse Training Data.
Abstract. Building models and learning patterns from a collection of data are essential tasks for decision making and dissemination of knowledge. One of the common tools to extract knowledge is to build a classifier. However, when the training dataset is sparse, it is difficult to build an accurate classifier. This is especially true in biological science, as biological data are hard to produce and error-prone. Through empirical results, this paper shows challenges in building an accurate classifier with a sparse biological training dataset. Our findings indicate the inadequacies in well known classification techniques. Although certain clustering techniques, such as seeded k-Means, show some promise, there are still spaces for further improvement. In addition, we propose a novel idea that could be used to produce more balanced classifier when training data samples are very limited. 1
MultiRelational k%2DAnonymity.

AC%2DFramework for Privacy%2DPreserving Collaboration.
The secure mlllti-party compnt.ation (ShIC) illode1 provitles ineails for l~alailciilg the use and confidentiality of distribut.ed data. Iilcreasiilg security coilcerils 11al.e led to a surge in work oil practical secure 1nult.i-party coinputatioil protocols. However. inost are only proveil secure under the semi-hoilest model, and security under this adversary illode1 is iils~~fici~iit for illost applications. I11 this paper: we propose a no\rel frame~vork: accoui~tal~le coinputi~ig (XC) framework. ~17llicll is sufficient or practical for man!- applic.ations \vitlioiit the coinplesit,y and cost of a ShIC-protocol under the malicious model. F~lrtherinore. to sho ~ tlie a~)plical~ilit~- of t.1le AC-framework. we present an applicatioil under this framework regarding PI-i\-acy-preser\.iilg illillillg frequent it,emset,s.. 1
Hiding the presence of individuals from shared databases.
increasing both the need for anonymized data and the risks of poor anonymization. We present a metric, δ-presence, that clearly links the quality of anonymization to the risk posed by inadequate anonymization. We show that existing anonymization techniques are inappropriate for situations where δ-presence is a good metric (specifically, where knowing an individual is in the database poses a privacy risk), and present algorithms for effectively anonymizing to meet δ-presence. The algorithms are evaluated in the context of a real-world scenario, demonstrating practical applicability of the approach.
Thoughts on k%2Danonymization.

TKDE Guidelines for Survey Papers.

Thoughts on k%2DAnonymization.

Transforming Semi%2DHonest Protocols to Ensure Accountability.

A secure distributed framework for achieving k%2Danonymity.
Abstract k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. Due to privacy issues, it is common that data from different sites cannot be shared directly. Therefore, this paper presents a two-party framework along with an application that generates k-anonymous data from two vertically partitioned sources without disclosing data from one site to the other. The framework is privacy preserving in the sense that it satisfies the secure definition commonly defined in the literature of Secure Multiparty Computation.
Privacy%2DPreserving Decision Trees over Vertically Partitioned Data.
Abstract. Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. In this paper, we tackle the problem of classification. We introduce a generalized privacy preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with the algorithm, we give a complete proof of security that gives a tight bound on the information revealed. 1
Privacy%2DPreserving Distributed k%2DAnonymity.
Abstract. k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. This paper presents a k-anonymity protocol when the data is vertically partitioned between sites. A key contribution is a proof that the protocol preserves k-anonymity between the sites: While one site may have individually identifiable data, it learns nothing that violates k-anonymity with respect to the data at the other site. This is a fundamentally different distributed privacy definition than that of Secure Multiparty Computation, and it provides a better match with both ethical and legal views of privacy.
Security Issues in Querying Encrypted Data.
There has been considerable interest in querying encrypted data,  allowing a &#034;secure database server&#034; model where the server does not  know data values. This paper shows how results from cryptography  prove the impossibility of developing a server that meets cryptographicstyle  definitions of security and is still e#cient enough to be practical.
Knowledge Discovery from Transportation Network Data.
Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mining and knowledge discovery techniques is largely untapped. Transportation networks are naturally represented as graphs. This paper explores the problems in mining of transportation network graphs: We hope to find how current techniques both succeed and fail on this problem, and from the failures, we hope to present new challenges for data mining. Experimental results from applying both existing graph mining and conventional data mining techniques to real transportation network data are provided, including new approaches to making these techniques applicable to the problems. Reasons why these techniques are not appropriate are discussed. We also suggest several challenging problems to precipitate research and galvanize future work in this area. 1
Privacy%2DPreserving Top%2DK Queries.
There is an increasing need for ranked and “best match” queries, in particular the top-k query: Finding the k closest matches to a query “point”. Top-k queries are particularly relevant when dealing with privacy-sensitive information. For example, profiling has potential anti-terrorism applications (e.g., finding visa applicants who are likely terrorists). Profiles rarely match individuals exactly- a prime example of the need for similarity or best match queries. However, profiles often match innocent people (or transactions), subjecting them to unwarranted scrutiny. By stripping a top-k query to its minimum – disclosing only an unranked set of k matches – we meet the goals of the top-k query while maintaining the privacy concept of k-anonymity[5]. In the context of profiling, k-anonymity requires that any individual that “matches ” be indistinguishable
Privacy%2DPreserving Top%2DK Queries.
There is an increasing need for ranked and “best match” queries, in particular the top-k query: Finding the k closest matches to a query “point”. Top-k queries are particularly relevant when dealing with privacy-sensitive information. For example, profiling has potential anti-terrorism applications (e.g., finding visa applicants who are likely terrorists). Profiles rarely match individuals exactly- a prime example of the need for similarity or best match queries. However, profiles often match innocent people (or transactions), subjecting them to unwarranted scrutiny. By stripping a top-k query to its minimum – disclosing only an unranked set of k matches – we meet the goals of the top-k query while maintaining the privacy concept of k-anonymity[5]. In the context of profiling, k-anonymity requires that any individual that “matches ” be indistinguishable
Dependable Real%2DTime Data Mining.
In this paper we discuss the need for real-time data mining for many applications in government and industry and describe resulting research issues. We also discuss dependability issues including incorporating security, integrity, timeliness and fault tolerance into data mining. Several different data mining outcomes are described with regard to their implementation in a real-time environment. These outcomes include clustering, association-rule mining, link analysis and anomaly detection. The paper describes how they would be used together in various parallel-processing architectures. Stream mining is discussed with respect to the challenges of performing data mining on stream data from sensors. The paper concludes with a summary and discussion of directions in this emerging area. 1.
Secure set intersection cardinality with application to association rule mining.
There has been concern over the apparent conflict between privacy and data mining. There is no inherent conflict, as most types of data mining produce summary results that do not reveal information about individuals. The process of data mining may use private data, leading to the potential for privacy breaches. Secure Multiparty Computation shows that results can be produced without revealing the data used to generate them. The problem is that general techniques for secure multiparty computation do not scale to data-mining size computations. This paper presents an efficient protocol for securely determining the size of set intersection, and shows how this can be used to generate association rules where multiple parties have different (and private) information about the same set of individuals. 1
Privacy%2Dpreserving clustering with distributed EM mixture modeling.

The Indiana Center for Database Systems at Purdue University.
Work flow management requires language support for work flow specification and task specification. Many approaches and systems for work flow management therefore offer at least one new language for work flow specification; task specification is usually done in a traditional language. This is motivated in particular by the fact that many components already exist and the task of the work flow tool is the specification of the interaction between these components. The intention of this article is to demonstrate that a general purpose programming language can serve both aspects. We do not really see the need to develop yet another language that a user or application programmer must learn. If an existing programming language like C or Prolog is extended towards work flow capabilities, it is easy to reuse autonomous existing software components and to build interfaces among them.
Privacy%2Dpreserving data integration and sharing.
The goal of this paper is to identify potential research directions and challenges that need to be addressed to perform privacy preserving data integration. Increasing privacy and security consciousness has lead to increased research (and development) of methods that compute useful information in a secure fashion. Data integration and sharing have been a long standing challenge for the database community. This need has become critical in numerous contexts, including integrating data on the Web and at enterprises, building ecommerce market places, sharing data for scientific research, data exchange at government agencies, monitoring health crises, and improving homeland security. Unfortunately, data integration and sharing are hampered by legitimate and widespread privacy concerns. Companies could exchange information to boost productivity, but are prevented by fear of being exploited by competitors or antitrust concerns. Sharing healthcare data could improve scientific research, but the cost of obtaining consent to use individually identifiable information can be prohibitive. Sharing healthcare and consumer data enables early detection of disease outbreak[16], but without provable privacy protection it is difficult to extend these surveillance measures nationally or internationally. Fire departments could
Privacy%2DPreserving Outlier Detection.
Outlier detection can lead to the discovery of truly unexpected knowledge in many areas such as electronic commerce, credit card fraud and especially national security. We look at the problem of finding outliers in large distributed databases where privacy/security concerns restrict the sharing of data. Both homogeneous and heterogeneous distribution of data is considered. We propose techniques to detect outliers in such scenarios while giving formal guarantees on the amount of information disclosed. 1.
A CMOS low%2Dpower ADC for DVB%2DT and DVB%2DH systems.

When do data mining results violate privacy%3F
bugün oldu˘gum yere asla gelemez idim. Bu yüzden doktora tezimi size adıyorum. Sizin hakkınızı asla ödeyemem. Umarim size lǎyik bir evlat olabilmi¸simdir. iii ACKNOWLEDGMENTS I feel extremely lucky to have been advised by Prof. Chris Clifton. He has been a great mentor and a good role model. He has always kept his door open to me and patiently answered all my questions. He has helped me in my research and in many practical issues like how to fix my car. Without him, I would not have been able to complete my degree. I also would like to acknowledge the huge contributions of my other committee members. Prof. Mike Atallah has made many useful suggestions related to my research. Discussions with him have been enlightening and inspiring. Prof. Elisa Bertino has been very supportive during my job hunt. Her wonderful database security course has helped me in seeing the big picture. Our discussions with her
Privately Computing a Distributed k%2Dnn Classifier.
Abstract. The ability of databases to organize and share data often raises privacy concerns. Data warehousing combined with data mining, bringing data from multiple sources under a single authority, increases the risk of privacy violations. Privacy preserving data mining provides a means of addressing this issue, particularly if data mining is done in a way that doesn’t disclose information beyond the result. This paper presents a method for privately computing k − nn classification from distributed sources without revealing any information about the sources or their data, other than that revealed by the final classification result. 1
Privacy Preserving Na%EFve Bayes Classifier for Vertically Partitioned Data.

Privacy%2DPreserving Data Mining Why%2C How%2C and When.

TopCat Data Mining for Topic Identification in a Text Corpus.
TopCat (Topic Categories) is a technique for identifying topics that recur in articles in a text corpus. Natural language processing techniques are used to identify key entities in individual articles, allowing us to represent an article as a set of items. This allows us to view the problem in a database/data mining context: Identifying related groups of items. This paper presents a novel method for identifying related items based on &#034;traditional&#034; data mining techniques. Frequent itemsets are generated from the groups of items, followed by clusters formed with a hypergraph partitioning scheme. We present an evaluation against a manually-categorized &#034;ground truth&#034; news corpus showing this technique is effective in identifying &#034;topics&#034; in collections of news articles.
Privacy%2DPreserving Distributed Mining of Association Rules on Horizontally Partitioned Data.
Data mining can extract important knowledge from large data collections -- but sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data, and some types of information about the data. This paper addresses secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the information shared, while adding little overhead to the mining task.
Assuring privacy when big brother is watching.
Homeland security measures are increasing the amount of data collected, processed and mined. At the same time, owners of the data raised legitimate concern about their privacy and potential abuses of the data. Privacy-preserving data mining techniques enable learning models without violating privacy. This paper addresses a complementary problem: What if we want to apply a model without revealing it? This paper presents a method to apply classification rules without revealing either the data or the rules. In addition, the rules can be verified not to use “forbidden ” criteria.
Privacy%2Dpreserving k%2Dmeans clustering over vertically partitioned data.
 
Privacy%2DEnhanced Data Management for Next%2DGeneration e%2DCommerce.

Leveraging the %22Multi%22 in secure multi%2Dparty computation.
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in sensitive data on networked computers, along with improved ability to integrate and utilize that data, make the time ripe for practical secure multi-party computation. This paper surveys approaches to secure multi-party computation, and gives a method whereby an e#cient protocol for two parties using an untrusted third party can be used to construct an e#cient peer-to-peer secure multi-party protocol.
Derived access control specification for XML.
The growth in interchange of business and other sensitive data has led to increasing interest in access control. While broad-based access control may be adequate for library-style document bases, new applications demand different access rights on different documents, or different parts of a document. Methods have been developed that enforce fine-grained access control in XML, but the administrative complexity of hard-coding rules is still a challenge. We present an XQuery-based approach for deriving access control rules from schemalevel rules, document or database content, or rules on other documents. This approach provides a novel capability to exploit non-structural information in broadlyapplicable rules, making it feasible to specify data- and context-dependent rules for large document sets.
Change Detection in Overhead Imagery Using Neural Networks.
Identifying interesting changes from a sequence of overhead imagery -- as opposed  to clutter, lighting/seasonal changes, etc. -- has been a problem for some time. Recent  advances in data mining have greatly increased the size of datasets that can be  attacked with pattern discovery methods. This paper presents a technique for using  predictive modeling to identify unusual changes in images. Neural networks are trained  to predict &#034;before&#034; and &#034;after&#034; pixel values for a sequence of images. These networks  are then used to predict expected values for the same images used in training.
Privacy%2DPreserving Distributed Mining of Association Rules on Horizontally Partitioned Data.
Data mining can extract important knowledge from large data collections -- but sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data, and some types of information about the data. This paper addresses secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the information shared, while adding little overhead to the mining task.
Privacy preserving association rule mining in vertically partitioned data.
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each site holds some attributes of each transaction, and the sites wish to collaborate to identify globally valid association rules. However, the sites must not reveal individual transaction data. We present a two-party algorithm for efficiently discovering frequent itemsets with minimum support levels, without either site revealing individual transaction values.
Tools for Privacy Preserving Data Mining.
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.
GeoNode An End%2Dto%2DEnd System from Research Components.

Real%2DTime Data Mining of Multimedia Objects.
Whereas much of the previous work on data mining has focused on mining data in relational databases, in this paper we discuss mining objects. Object models are very popular for representing multimedia data and, therefore, we need to mine object databases to extract useful information from the large quantities of multimedia data. We first describe the motivation for multimedia data mining with examples and then discus object mining with focus on text, image, video and audio mining. We also address the need for real-time data mining for multimedia applications. 1.
Directions for Web and E%2DCommerce Applications Security.
urtinsubria. it This paper provides directions for web and e-commerce applications security. In particular, access contra1 policies, workflow security, XML security arid federated database security issues pertaining to the web and e-commerce applications are discussed. 1.
Using Unknowns to Prevent Discovery of Association Rules.

SEMINT A tool for identifying attribute correspondences in heterogeneous databases using neural networks.
 
Using Sample Size to Limit Exposure to Data Mining.
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the “probabilistic” inferences possible with data mining. This paper shows how lower bounds from pattern recognition theory can be used to determine sample sizes where data mining tools cannot obtain reliable results. 1
Database Integration Using Neural Networks Implementation and Experiences.

Protecting Against Data Mining through Samples.
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the “probabilistic ” inferences possible with data mining. This paper shows how lower bounds from pattern recognition theory can be used to determine sample sizes where data mining tools cannot obtain reliable results. 1.
Panel on Intrusion Detection.

TopCat Data Mining for Topic Identification in a Text Corpus.
TopCat (Topic Categories) is a technique for identifying topics that recur in articles in a text corpus. Natural language processing techniques are used to identify key entities in individual articles, allowing us to represent an article as a set of items. This allows us to view the problem in a database/data mining context: Identifying related groups of items. This paper presents a novel method for identifying related items based on &#034;traditional&#034; data mining techniques. Frequent itemsets are generated from the groups of items, followed by clusters formed with a hypergraph partitioning scheme. We present an evaluation against a manually-categorized &#034;ground truth&#034; news corpus showing this technique is effective in identifying &#034;topics&#034; in collections of news articles.
Data Mining on Text.

Query Flocks A Generalization of Association%2DRule Mining.
Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the objectives, but to the fact that a number of new query-optimization ideas, such as the “a-priori ” trick, make association-rule mining run much faster than might be expected. In this paper we see that the same tricks can be extended to a much more general context, allowing efficient mining of very large databases for many different kinds of patterns. The general idea, called “query flocks,” is a generate-and-test model for data-mining problems. We show how the idea can be used either in a general-purpose mining system or in a next generation of conventional query optimizers. 1
Multidatabase Query Processing with Uncertainty in Global Keys and Attribute Values.

Security Issues in Data Warehousing and Data Mining Panel Discussion.

Experience with a Combined Approach to Attribute%2DMatching Across Heterogeneous Databases.
Determining attribute correspondences is a difficult, time-consuming, knowledgeintensive part of database integration. We report on experiences with tools that identified candidate correspondences, as a step in a large scale effort to improve communication among Air Force systems. First, we describe a new method that was both simple and surprisingly successful: Data dictionary and catalog information were dumped to unformatted text; then off-the-shelf information retrieval software estimated string similarity, generated candidate matches, and provided the interface. The second method used a different set of clues, such as statistics on database populations, to compute separate similarity metrics (using neural network techniques). We report on substantial use of the first tool, and then report some limited initial experiments that examine the two techniques&#039; accuracy, consistency and complementarity. Keywords  correspondence investigation, data mining  1 INTRODUCTION  Perhaps the most b...
Experience with a Combined Approach to Attribute%2DMatching Across Heterogeneous Databases.
Determining attribute correspondences is a difficult, time-consuming, knowledgeintensive part of database integration. We report on experiences with tools that identified candidate correspondences, as a step in a large scale effort to improve communication among Air Force systems. First, we describe a new method that was both simple and surprisingly successful: Data dictionary and catalog information were dumped to unformatted text; then off-the-shelf information retrieval software estimated string similarity, generated candidate matches, and provided the interface. The second method used a different set of clues, such as statistics on database populations, to compute separate similarity metrics (using neural network techniques). We report on substantial use of the first tool, and then report some limited initial experiments that examine the two techniques&#039; accuracy, consistency and complementarity. Keywords  correspondence investigation, data mining  1 INTRODUCTION  Perhaps the most b...
Dynamic Integration and Query Processing with Ranked Role Sets.
The role-set approach is a new conceptual framework for data integration in multidatabase systems  that maintains the materialization autonomy of local database systems and provides users with more  accurate information. The role-set approach presents the answer to a query as a set of relations where  the distinct intersections between the relations corresponding to the various roles played by an entity.
How are We Going to Pay for This%3F Fee%2Dfor%2DService in Distributed Systems Research and Policy Issues %28Panel%29.

Classifying Software Components Using Design Characteristics.
Classlfying sofhvare modules in a component library is a major problem in software reuse. Indexing criteria must adequately re$ect the semantics of the components. This must be done without undue effort in either classifying the software, or developing ‘“queries’ ’ to find candidates for reuse. We present an architecture for automatically classifying and querying software based on design information. We present a method for d(etermining if indexing criteria are effective, and show results using a set of criteria automatically extracted from an existing collection of programs.
Semint A System Prototype for Semantic Integration in Heterogeneous Databases.

HyperFile A Data and Query Model for Documents

Semantic Integration in Heterogeneous Databases Using Neural Networks.
One important step in integrating heteroge-neous databases is matching equivalent at-tributes: Determining which fields in two databases refer to the same data. The mean-ing of information may be embodied within a. database model, a conceptual schema, appli-cation programs, or data contents. Integra-tion involves extracting semantics, expressing them as metadata, and matching semantically equivalent data elements. We present a proce-dure using a classifier to categorize attributes according to their field specifications and data values, then train a neural network to recog-nize similar attributes. In our technique, the knowledge of how to match equivalent data elements is “discovered ” from metadata, not “pre-programmed”. 1
Information Brokers Sharing Knowledge in a Heterogeneous Distributed System.
[36] Timos Sellis, Nick Roussopoulos, and Christos Faloutsos. The R+-tree: A dynamic index for
The Gold Mailer.
The goal of the Gold project is to implement a set of tools to interoperate with unstructured and semistructured data and services. We have selected the electronic mail domain ad the first scenario in which to implement and demonstrate some of the tools. This paper describes the Gold Mailer, a system that provides wers with an integrated way to send and receive messages wing different media (e-mail, fozes, phones), eficiently store and retrieve these messages, and access a variety of sources of other weful information. Our mailer solves the problems of information overload, Organization of messages and multiple interfaces. By providing good storage and retrieval facilities, it can be wed ad a powerful information processing engine covering a range of weful office information. Unlike some recent research efforta ([Ter90, KT088, LYY891) which have implemented mailers with relational-like query facilities, the Gold mailer provides a database system interface that fits more naturally. This document ezplains the current implementation of the Gold mailer. 1
Using Field Specifications to Determine Attribute Equivalence in Heterogeneous Databases.
One step in integrating heterogeneous database systems is matching equivalent attributes: Determining which fields in the two databases refer to the same data. We see three (complementary) techniques to automate this process: Synonym dictionaries that compare field names, design criteria that compare field specifications, and comparison of data values. In this paper we present a technique for using field specifications to compare attributes, and evaluate this technique on a variety of databases. 1
Distributed processing of filtering queries in HyperFile.

Data Management with Massive Memory A Summary.

Indexing in a Hypertext Database.
Database indexing is a well studied problem. However, the advent of Hypertext databases opens new questions in indexing. Searches are often demarcated by pointers between text items. Thus the scope of the search may change dynamically, whereas traditional indexes cover a statically defined region such as a relation. We present techniques for indexing in hypertext databases and com-pare their performance. 1.
